Functions on Probabilistic Graphical Models
نویسندگان
چکیده
Probabilistic graphical models are tools that are used to represent the probability distribution of a vector of random variables X = (X1, . . . , XN ). In this paper we introduce functions f(x1, . . . , xN) defined over the given vector. These functions also are random variables. The main result of the paper is an algorithm for finding the expected value and other moments for some classes of f(x1, . . . , xN). The possible applications of that algorithm are discussed. Specifically, we use it to analyze the entropy of X and to compute the relative entropy of two probability distributions of the same vector X . Finally, open problems and possible topics of future researches are discussed.
منابع مشابه
Rule-based joint fuzzy and probabilistic networks
One of the important challenges in Graphical models is the problem of dealing with the uncertainties in the problem. Among graphical networks, fuzzy cognitive map is only capable of modeling fuzzy uncertainty and the Bayesian network is only capable of modeling probabilistic uncertainty. In many real issues, we are faced with both fuzzy and probabilistic uncertainties. In these cases, the propo...
متن کاملExact Inference for Relational Graphical Models with Interpreted Functions: Lifted Probabilistic Inference Modulo Theories
Probabilistic Inference Modulo Theories (PIMT) is a recent framework that expands exact inference on graphical models to use richer languages that include arithmetic, equalities, and inequalities on both integers and real numbers. In this paper, we expand PIMT to a lifted version that also processes random functions and relations. This enhancement is achieved by adapting Inversion, a method fro...
متن کاملOn the Links between Probabilistic Graphical Models and Submodular Optimisation. (Liens entre modèles graphiques probabilistes et optimisation sous-modulaire)
A probabilistic graphical model encodes conditional independences among random variables, which is related to factorisable distributions. Moreover, the entropy of a probability distribution on a set of discrete random variables is always bounded by the entropy of its factorisable counterpart. This is due to the submodularity of entropy on the set of discrete random variables. Submodular functio...
متن کاملGraphical model approach to pitch tracking
Many pitch trackers based on dynamic programming require meticulous design of local cost and transition cost functions. The forms of these functions are often empirically determined and their parameters are tuned accordingly. Parameter tuning usually requires great effort without a guarantee of optimal performance. This work presents a graphical model framework to automatically optimize pitch t...
متن کاملMaximizing submodular functions using probabilistic graphical models
We consider the problem of maximizing submodular functions; while this problem is known to be NP-hard, several numerically efficient local search techniques with approximation guarantees are available. In this paper, we propose a novel convex relaxation which is based on the relationship between submodular functions, entropies and probabilistic graphical models. In a graphical model, the entrop...
متن کامل